A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm

Distributed Sub-gradient Method for Delay Tolerant Networks

The proximal-proximal gradient algorithm

We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a composition of a proper closed convex function P and a nonzero affine map, with the proximal mappings of τP , τ > 0, easy to compute. In this case, a direct applic...

Distributed Delayed Proximal Gradient Methods

We analyze distributed optimization algorithms where parts of data and variables are distributed over several machines and synchronization occurs asynchronously. We prove convergence for the general case of a nonconvex objective plus a convex and possibly nonsmooth penalty. We demonstrate two challenging applications, `1-regularized logistic regression and reconstruction ICA, and present experi...

Distributed Accelerated Proximal Coordinate Gradient Methods

We develop a general accelerated proximal coordinate descent algorithm in distributed settings (DisAPCG) for the optimization problem that minimizes the sum of two convex functions: the first part f is smooth with a gradient oracle, and the other one Ψ is separable with respect to blocks of coordinate and has a simple known structure (e.g., L1 norm). Our algorithm gets new accelerated convergen...

Token Traversal Strategies of a Distributed Spanning Forest Algorithm in Delay Tolerant MANETs

This paper presents several distributed and decentralized strategies used for token traversal in spanning forest over DTMs. DTMs or Delay Tolerant Mobile ad hoc networks are characterized by some undesirable behaviors like the disappearance of mobile devices, connection disruptions, network partitioning, etc. Providing efficient communications in DTMs is a very challenging issue. Techniques bas...